A Note on the Middle Levels Conjecture

نویسندگان

  • Manabu Shimada
  • Kazuyuki Amano
چکیده

The middle levels conjecture asserts that there is a Hamiltonian cycle in the middle two levels of 2k + 1-dimensional hypercube. The conjecture is known to be true for k ≤ 17 [I. Shields, B.J. Shields and C.D. Savage, Disc. Math., 309, 5271–5277 (2009)]. In this note, we verify that the conjecture is also true for k = 18 by constructing a Hamiltonian cycle in the middle two levels of 37-dimensional hypercube with the aid of the computer. We achieve this by introducing a new decomposition technique and an efficient algorithm for ordering the Narayana objects.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on Fouquet-Vanherpe’s question and Fulkerson conjecture

‎The excessive index of a bridgeless cubic graph $G$ is the least integer $k$‎, ‎such that $G$ can be covered by $k$ perfect matchings‎. ‎An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless‎ ‎cubic graph has excessive index at most five‎. ‎Clearly‎, ‎Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5‎, ‎so Fouquet and Vanherpe as...

متن کامل

A Further Note on Runs in Independent Sequences

Given a sequence of letters generated independently from a finite alphabet, we consider the case when more than one, but not all, letters are generated with the highest probability. The length of the longest run of any of these letters is shown to be one greater than the length of the longest run in a particular state of an associated Markov chain. Using results of Foulser and Karlin (19...

متن کامل

A note on the Entropy/Influence conjecture

The Entropy/Influence conjecture, raised by Friedgut and Kalai (1996) [9], seeks to relate two different measures of concentration of the Fourier coefficients of a Boolean function. Roughly saying, it claims that if the Fourier spectrum is “smeared out”, then the Fourier coefficients are concentrated on “high” levels. In this note we generalize the conjecture to biased product measures on the d...

متن کامل

Proof of the middle levels conjecture

Define the middle layer graph as the graph whose vertex set consists of all bitstrings of length 2n + 1 that have exactly n or n + 1 entries equal to 1, with an edge between any two vertices for which the corresponding bitstrings differ in exactly one bit. The middle levels conjecture asserts that this graph has a Hamilton cycle for every n ≥ 1. This conjecture originated probably with Havel, B...

متن کامل

Guest Editor\'s Note

Although Occupational Therapy in Iran is relatively a new profession, it has been well progressed, providing various services for people with all kinds of disabilities. As such, in the last decades, OT has been recognized as the major demand in all governmental, private and NGO sectors. Due to this demand, occupational therapy training programs have been increased from three into ten, expecting...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0912.4564  شماره 

صفحات  -

تاریخ انتشار 2009